Dynamic prioritized recovery

ABSTRACT

A method, article of manufacture, and apparatus for recovering data. In some embodiments, this includes selecting an object to be recovered, recovering sub-objects of the object based on the priorities assigned to the sub-objects, and reprioritizing the sub-objects based on an application&#39;s I/O during recovery. In some embodiments, reprioritizing the sub-objects the sub-objects includes assigning a lower priority to the sub-objects when an application has completed I/O on the object. In some embodiments, recovering sub-objects includes recovering sub-objects to a remote location.

CROSS REFERENCE TO OTHER APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 14/960,267, entitled DYNAMIC PRIORITIZED RECOVERY filed Dec. 4,2015 which is incorporated herein by reference for all purposes, whichis a continuation of U.S. patent application Ser. No. 12/828,205,entitled DYNAMIC PRIORITIZED RECOVERY filed Jun. 30, 2010, now U.S. Pat.No. 9,235,585, which is incorporated herein by reference for allpurposes.

FIELD OF THE INVENTION

The present invention relates generally to data systems, and moreparticularly, to systems and methods of efficiently protecting andaccessing data.

BACKGROUND OF THE INVENTION

Modern data systems contain vast amounts of data. Such data systems mayinclude, for example, email servers, commercial websites, bankingrecords, government databases, etc.

Increasingly, there is an expectation that these data systems mustalways be accessible to the user. For example, if a commercial websiteis not accessible to the user, (e.g. Amazon.com went down), the businessmay lose millions of dollars of revenue for every day the website isinaccessible.

With an ever increasing amount of data, and an ever increasingexpectation that the data be accessible, there is tremendous pressure toprotect data systems. Conventional data protection schemes are used torestore data systems in case of disasters. However, these conventionaldata protection schemes are either too slow in recovering the data, ortoo expensive. Further, conventional data protection schemes requirecompletely recovering the data before allowing access to the data.

Unfortunately, there may be times when data in a data system needs to beaccessible before the recovery operation is complete.

There is a need, therefore, for an improved method, article ofmanufacture, and apparatus for protecting and accessing data in datasystems.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be readily understood by the followingdetailed description in conjunction with the accompanying drawings,wherein like reference numerals designate like structural elements, andin which:

FIG. 1 is a diagram of a data system in accordance with someembodiments.

FIG. 2 is a flowchart of a method to backup data in accordance with someembodiments.

FIG. 3 is a flowchart of a method to recover data in accordance withsome embodiments.

FIG. 4 is a flowchart of a method to access data in accordance with someembodiments.

FIG. 5 is a flowchart of a method to preserve data in accordance withsome embodiments.

DETAILED DESCRIPTION

A detailed description of one or more embodiments of the invention isprovided below along with accompanying figures that illustrate theprinciples of the invention. While the invention is described inconjunction with such embodiment(s), it should be understood that theinvention is not limited to any one embodiment. On the contrary, thescope of the invention is limited only by the claims and the inventionencompasses numerous alternatives, modifications, and equivalents. Forthe purpose of example, numerous specific details are set forth in thefollowing description in order to provide a thorough understanding ofthe present invention. These details are provided for the purpose ofexample, and the present invention may be practiced according to theclaims without some or all of these specific details. For the purpose ofclarity, technical material that is known in the technical fieldsrelated to the invention has not been described in detail so that thepresent invention is not unnecessarily obscured.

It should be appreciated that the present invention can be implementedin numerous ways, including as a process, an apparatus, a system, adevice, a method, or a computer readable medium such as a computerreadable storage medium containing computer readable instructions orcomputer program code, or as a computer program product, comprising acomputer usable medium having a computer readable program code embodiedtherein. In the context of this disclosure, a computer usable medium orcomputer readable medium may be any medium that can contain or store theprogram for use by or in connection with the instruction executionsystem, apparatus or device. For example, the computer readable storagemedium or computer usable medium may be, but is not limited to, a randomaccess memory (RAM), read-only memory (ROM), or a persistent store, suchas a mass storage device, hard drives, CDROM, DVDROM, tape, erasableprogrammable read-only memory (EPROM or flash memory), or any magnetic,electromagnetic, infrared, optical, or electrical means system,apparatus or device for storing information. Alternatively oradditionally, the computer readable storage medium or computer usablemedium may be any combination of these devices or even paper or anothersuitable medium upon which the program code is printed, as the programcode can be electronically captured, via, for instance, optical scanningof the paper or other medium, then compiled, interpreted, or otherwiseprocessed in a suitable manner, if necessary, and then stored in acomputer memory. Applications, software programs or computer readableinstructions may be referred to as components or modules. Applicationsmay be hardwired or hard coded in hardware or take the form of softwareexecuting on a general purpose computer or be hardwired or hard coded inhardware such that when the software is loaded into and/or executed bythe computer, the computer becomes an apparatus for practicing theinvention. Applications may also be downloaded in whole or in partthrough the use of a software development kit or toolkit that enablesthe creation and implementation of the present invention. In thisspecification, these implementations, or any other form that theinvention may take, may be referred to as techniques. In general, theorder of the steps of disclosed processes may be altered within thescope of the invention.

An embodiment of the invention will be described with reference to adata system configured to store files, but it should be understood thatthe principles of the invention are not limited to data systems. Rather,they are applicable to any system capable of storing and handlingvarious types of objects, in analog, digital, or other form. Althoughterms such as document, file, object, etc. may be used by way ofexample, the principles of the invention are not limited to anyparticular form of representing and storing data or other information;rather, they are equally applicable to any object capable ofrepresenting information.

FIG. 1 illustrates a data system in accordance with some embodiments ofthe present invention. Data System 10 includes Namespace 100, Object102, Recovery Service 104, Container 106, Intercept 108, Application110, and Version 112. Though FIG. 1 illustrates Namespace 100, Object102, Recovery Service 104, Container 106, Intercept 108, Application110, and Version 112 to be separate components, it should be understoodthat these components may reside in one or multiple machines. Forexample, Recovery Service 104 and Container 106 may reside in the samemachine, while Intercept 108 and Application 110 reside in a differentmachine, and Object 102 and Namespace 100 reside in yet anotherdifferent machine.

Namespace 100 includes a set of name-address pairs. For example, in someembodiments, Namespace 100 may include a file system directorystructure. Namespace 100 is used by Application 110 to locate Object102.

Container 106 contains backup data. The backup data may include severalfiles, and several versions of the same file, as depicted by Version 112in FIG. 1. For example, a first backup may store a preliminary versionof a file. A second backup may store a final version of the file. Duringboth backups, the file may have the same file name. Instead ofoverriding the preliminary version of the file, the second backup maystore a second version of the file.

Version 112 may be segmented into sub-objects. It should be understoodthat though the term “Version” is used, there need not be multipleversions of a file in a container. For example, a container could have aFile X, and only have one version of File X. In this case, it would beFile X that is segmented into sub-objects.

Segmenting Version 112 may be accomplished by a variety of methods. Insome embodiments, segmenting may be done using a predefined interval(e.g. create segments at every 10 kB). In some embodiments, segmentingmay be done according to access pattern. For example, suppose Version112 is a backup of a virtual machine. If the first 30 kB of Version 112is necessary to boot the virtual machine, it may be preferable tosegment the first 30 kB. The rest of Version 112 may be segmented into30 kB segments, or may be segmented according to some other criteria(e.g. 40 kB segments, segmented according to other known accesspatterns, etc.). The remaining segments need not be identical in size toeach other, or to the initial 30 kB segment. Segmenting may also bebased upon metadata, such as file history maintained by an application,or upon policy or user command.

In some embodiments, segments may be assigned priorities. Priorities maybe assigned through a variety of methods. In some embodiments, accesspatterns may be used as criteria in assigning priority. In the exampleabove, it may be preferable to assign the highest priority to the first30 kB of the backup of the virtual machine. Since any user of thevirtual machine would first have to access the first 30 kB to boot thevirtual machine, it would be preferable to recover the first 30 kB asquickly as possible. By assigning the highest priority to the first 30kB, a recovery operation would be able to see the highest priorityassigned to the first 30 kB, and recover it as soon as possible. Otheraccess patterns may be used to determine priority. For example, supposeVersion 112 is a backup of a Microsoft Word application, and that thelast 5 kB of the backup contains the “most recently accessed files”list. A user may decide that they want to know which files were mostrecently accessed and assign that 5 kB segment a high priority.Similarly, a policy could be set such that the most recently accessedfiles are most likely the first to be accessed upon recovery, and assigneach of the files in the “most recently accessed files” list a highpriority. Low priorities may be set using similar logic. For example, ifcertain sub-objects are not likely to be accessed during a recoveryoperation, those sub-objects may be assigned a low priority.

Segments (e.g. sub-objects) or versions (e.g. objects) may be “pinned.”Pinning an object or sub-object restricts the pinned object orsub-object to a “Remote I/O” setting during a recovery operation asdescribed herein. Pinning may be preferable when the object beingrecovered is highly sensitive, and data integrity is of the utmostimportance (outweighs performance importance). For example, if an objectbeing recovered is a large database, data integrity may be compromisedif recovery is done in parallel sub-objects. In this case, it may bepreferable to quickly restore the large database to a remote location(but “local” to container, allowing rapid data transfer between thetwo), and allow remote access from the client. In this way, dataintegrity is protected, but the client may notice a decline inperformance due to bandwidth and resource issues associated withaccessing a remote location.

In cases where backup data includes a transactional database, it may bepreferable to also backup a transaction log along with the data objects.For example, when a transactional database fails, the state of theobjects being accessed at the time of the failure may be unknown. Insome cases, the last write request may have been done, but there was noconfirmation. In other cases, the last write request may not have beendone at all. With a transaction log, it can be determined whether awrite request had been properly executed, allowing a recovery operationto determine which version of a file to recover.

FIG. 2 illustrates a method to backup data in accordance with someembodiments. In step 200, an object is backed up to a repository. Instep 202, the object is segmented into a plurality of sub-objects. Asdiscussed above, the segmenting of objects may be based on a variety ofcriteria. For example, segmenting may be based on access pattern,metadata, policy or command, among others, or any combination ofcriteria. In step 204, a priority is assigned to a sub-object. Asdiscussed above, priority may also be assigned based on a variety ofcriteria. For example, priority may be based on access pattern,metadata, policy, or user command, among others, or any combination ofcriteria. It should be noted that not every sub-object needs a priorityassigned. In some embodiments, it may be preferable to “pin” asub-object to Remote I/O during a recovery operation. In someembodiments, the prioritization itself may be stored as metadata in thebackup repository, or as a header in each of the segments.

Application 110 includes one or more computing processes executing onone or more machines, where each computing process may performinput/output (I/O) from one or more devices. For example, in someembodiments, Application 110 may include a Microsoft Exchange Serverclient.

Recovery Service 104 manages the recovery of Object 102. In someembodiments, Recovery Service 104 may track changes to Object 102 andVersion 112, such as during Remote I/O.

FIG. 3 illustrates a method to recover data in accordance with someembodiments. In step 300, an object is selected to be recovered. In step302, the sub-objects of the object are recovered based on the prioritiesassigned to the sub-objects. In step 304, the sub-objects arereprioritized based on an application's I/O during recovery. Forexample, an application may want to access a sub-object with a lowpriority. If the sub-object has not been recovered yet, the sub-object'spriority may be changed to high priority, so that the recovery operationcan quickly recover the sub-object, and allow the application to accessthe sub-object.

Object 102 includes a data object that is being recovered by RecoveryService 104 while Application 110 is using the data object. Object 102is restored using Version 112, which is part of Container 106. In someembodiments, Object 102 may be segmented into sub-objects. SegmentingObject 102 into sub-objects allows for parallel recovery of thesub-objects.

As illustrated by Object 102 in FIG. 1, Application 110 may access dataobjects through multiple methods. One method is Local I/O. This is whenthe data (e.g. sub-object) has been fully recovered to the local site.During local I/O, Intercept 108 allows Application 110 to locally accessa sub-object in Object 102. In some embodiments, during Local I/O,Intercept 108 may act as an intermediary between Application 110 and thesub-object. For example, Application 110 may send a request to whatApplication 110 thinks is the sub-object. Intercept 108 intercepts therequest, retrieves the requested data from the sub-object, and sends therequested data to Application 110. In some embodiments, during LocalI/O, Intercept 108 may act as a gatekeeper, and allow Application 110 tocommunicate directly with the sub-object. For example, Application 110may send a request to what Application 110 thinks is the sub-object.Intercept 108 intercepts the request, determines whether the request mayproceed or not, and if so, allows the request to go through. Application110 then receives the requested data directly from the sub-object. Insome embodiments, after Intercept 108 has determined that Application110 may directly communicate with the sub-object, subsequent requests byApplication 110 to retrieve data from the sub-object need not undergothe determination phase as described herein (e.g. Intercept 108 will nolonger need to determine if Application 110 may access the sub-object.)Though the term “Local I/O” is used, “Local” does not mean thatApplication 110 is accessing data that is on the same machine asApplication 110. Rather, “Local” may include machines that aregeographically distant, but may be connected by a comparatively higherbandwidth connection. “Local” may also include machines that arenormally accessed by Application 110. For example, a Microsoft Exchangeclient resident in California may typically connect to data that isstored in Oregon. A backup copy of the data may be stored in Washington.During recovery, the backup copy is restored to Oregon. When asub-object is restored to Oregon, the California client may “locally”access the Oregon sub-object via “Local I/O.”

Another method of Application 110 accessing data is Remote I/O. Thisoccurs when a sub-object has not been restored to the local site, butApplication 110 needs access to the sub-object. This may also occur whenthe object or sub-objects being restored are “pinned” as describedherein. In some embodiments, Intercept 108 will intercept Application110's request, and redirect to Recovery Service 104. Recovery Service104 will perform Application 110's request on a copy of the sub-objectmaintained by Recovery Service 104. Data objects which are accessed viaRemote I/O are spun-up (e.g. booted, mounted, recovered, etc.) byRecovery Service 104 on a system with fewer resource constraints than atthe primary system. For example, Recovery Service 104 may mount avirtual machine on a physical machine that is “local” to the container,resulting in a high bandwidth connection between the two, and allowingfor a much faster restoration of the virtual machine. A remoteconnection is established between Application 110 and the spun-up dataobjects, allowing I/O operations. This may be useful when the sub-objecthas not been restored to the local site, but when immediate access tothe sub-object is required or preferred. For example, it may take asignificant amount of time to repair or replace failed components at thelocal site. During the interim, Application 110 may need to access data.Rather than wait for the replacement components to arrive, Application110 may use Remote I/O to access data that is spun up by RecoveryService 104. Further, Remote I/O may be preferable when impact ofconcurrent recovery on application services using available networkbandwidth is unacceptable, or when the risk of data integrity is toohigh, such as in the case when an object being restored is a largedatabase.

Another method of Application 110 accessing data is Recover on Access.This includes Application 110 sending an I/O request to the sub-object,and Intercept 108 delaying the I/O request to the sub-object until thesub-object has been recovered. This may be preferable when theperformance impact due to the delayed I/O request is tolerable.

In some embodiments, Intercept 108 is code that is transparent toApplication 110. In other words, Application 110 thinks it is accessingObject 102 locally when in fact Intercept 108 is rerouting Application110's instructions to Recovery Service 104.

FIG. 4 illustrates a method to access data during data recovery inaccordance with some embodiments. In step 400, an I/O request is sentfrom an application to an object, wherein the object is being recovered.In step 402, an I/O intercept is established. In step 404, theapplication's I/O request is intercepted by the I/O intercept. In step406, the I/O request is redirected based on the status of the object'ssub-objects. In some embodiments, once an application is able to accessa sub-object via Local I/O, the I/O intercept no longer needs tointercept the application's I/O requests because the sub-object has beenrecovered. In such cases, the I/O intercept may be abolished with regardto the recovered sub-object and allow the application's I/O requests toproceed uninhibited.

Recovery may be prioritized. As discussed above, segments of backup data(e.g. objects or versions) may have assigned priority. When a recoveryoperation detects these priorities, it may recover segments based onpriority. For example, suppose the first 30 kB of an object is a segmentcontaining the boot up information for a virtual machine, and the first30 kB has been assigned the highest priority. When a recovery operationscans the object, it will identify the first 30 kB as having the highestpriority, and begin restoring the first 30 kB before lower prioritysegments.

Priority of restoration may be dynamic during a recovery operation. Forexample, suppose the last 100 kB of a backup image, the backup imagebeing a version, contains the two most recently accessed files, File Aand File B. A post-back up operation may have identified these files tobe a high priority since they were the two most recently accessed files,and a policy dictated that recently accessed files are to be assigned ahigh priority. However, during a recovery process, a user may attempt toaccess the middle 50 kB, which contains a rarely accessed File C. SinceFile C is rarely accessed, a policy may have dictated that it beassigned a low priority, and a recovery operation placed a low priorityon restoring File C. When the recovery operation detects that anapplication is trying to access File C, or when an interceptor tellsrecovery operation that an application is trying to access File C, therecovery operation may change the priority of File C to high. Dependingon the performance tolerance of File C, or other restrictions placed bypolicy or user, access to File C may be Remote I/O, or Recover onAccess. For example, if the user considers File C to be a very importantfile, where data integrity is of the utmost importance, the user mayforce the recovery operation to allow access to File C via Remote I/O.In another example, if File C can be restored in a relatively shortperiod of time, and the user can tolerate the performance decline (e.g.waiting for File C to be restored before accessing), then the recoveryoperation may use Recovery on Access as described herein.

Further, priorities may be altered during an object close. For example,suppose an object, object Z is being restored. Object Z has threesub-objects, sub-objects A, B, and C. A has been restored, and isaccessed by an application via Local I/O. B is being restored, but hasnot yet been restored. C has been “pinned,” and is restricted to remoteI/O. During the recovery operation, an application accesses onlysub-object A. Before recovery of B or C, the application is finishedwith object Z, and closes object Z. At this point, it may be preferableto re-assign B and C to a low priority since the application may be donewith object Z and need not access it for the remainder of the recoveryoperation.

In some embodiments, it may be preferable to retain a copy of an alteredsub-object as a result of Remote I/O. Using the above example, supposethe application had accessed sub-object A via Local I/O, and sub-objectC via Remote I/O. Before recovery has been completed, the application isfinished with object Z. In this case, it may be beneficial for therecovery operation to preserve the changes made to sub-object C (e.g.preserve the remote copy of sub-object C), and to maintain the I/Ointercept. Maintaining the I/O intercept would be helpful in case theapplication again wants to access sub-object C during the recoveryoperation. Preserving the remote copy of C would be also be helpful incase the application gain wants to access sub-object C during therecovery operation. Once the application has closed object Z, therecovery operation may begin restoring the remote copy of C to thedesired restoration target, or may postpone restoration of the remotecopy of C due to re-assignment in priority or other settings determinedby policy or user.

FIG. 5 illustrates a method to preserve data changes made during datarecovery in accordance with some embodiments. In step 500, a backup isrecovered to a remote location. In step 502, an I/O intercept is used toaccess the recovered data. In step 504, the recovered data is modified afirst time. In step 506, the modification of the recovered data iscomplete (e.g. an application has closed the object). In step 508, theI/O intercept is preserved. In step 510, the modified data is stored inthe remote location. In some embodiments, the application may againaccess the modified data after closing the object (e.g. access thebackup data a second time). In this case, it is helpful to maintain theI/O intercept to facilitate Remote I/O. In some embodiments, after themodified data has been recovered to the local location (e.g. the remotelocation data has been fully restored to the local location), themodified data stored at the remote location may be deleted, may be addedto the backup data, or may replace the backup data. The modified datamay also be deleted from the remote location once a copy has beenrestored to the local location.

For the sake of clarity, the processes and methods herein have beenillustrated with a specific flow, but it should be understood that othersequences may be possible and that some may be performed in parallel,without departing from the spirit of the invention. Additionally, stepsmay be subdivided or combined. As disclosed herein, software written inaccordance with the present invention may be stored in some form ofcomputer-readable medium, such as memory or CD-ROM, or transmitted overa network, and executed by a processor.

All references cited herein are intended to be incorporated byreference. Although the present invention has been described above interms of specific embodiments, it is anticipated that alterations andmodifications to this invention will no doubt become apparent to thoseskilled in the art and may be practiced within the scope and equivalentsof the appended claims. More than one computer may be used, such as byusing multiple computers in a parallel or load-sharing arrangement ordistributing tasks across multiple computers such that, as a whole, theyperform the functions of the components identified herein; i.e. theytake the place of a single computer. Various functions described abovemay be performed by a single process or groups of processes, on a singlecomputer or distributed over several computers. Processes may invokeother processes to handle certain tasks. A single storage device may beused, or several may be used to take the place of a single storagedevice. The present embodiments are to be considered as illustrative andnot restrictive, and the invention is not to be limited to the detailsgiven herein. It is therefore intended that the disclosure and followingclaims be interpreted as covering all such alterations and modificationsas fall within the true spirit and scope of the invention.

What is claimed is:
 1. A method, comprising: selecting, by one or moreprocessors, a previously backed up data object to be recovered usingbackup data, wherein the data object includes a plurality ofsub-objects; recovering, by the one or more processors, the plurality ofsub-objects based on a first set of priorities assigned to thesub-objects; and reprioritizing, by the one or more processors, thesub-objects based at least in part on information associated with anapplication's I/O received after recovery of the previously backed updata object has started, wherein the information associated with theapplication's I/O that is used in connection with reprioritizing thesub-objects is obtained during recovery of the backup data and comprisesinformation pertaining to an I/O event that is detected during recoveryof the backup data.
 2. The method of claim 1, wherein the data objectcorresponds to a data file, the plurality of sub-objects correspond to aplurality of segments of the data file, and the data file is segmentedinto the plurality of segments according to an access pattern.
 3. Themethod of claim 2, wherein the priority respectively assigned to the atleast the subset of the plurality of sub-objects is assigned based atleast in part on an access state associated with an application's I/O ofthe data object.
 4. The method of claim 3, further comprising:detecting, by the one or more processors, the indication of the changein the access state associated with the application's I/O of the dataobject while the data object is being recovered, wherein the change inthe access state comprises one or more of the application attempting toaccess the data object and the application being finished with the dataobject.
 5. The method of claim 4, wherein the respective priorityassigned to the at least the subset of the plurality of sub-objects isassigned based at least in part on the changed access state associatedwith the application's I/O of the data object.
 6. The method of claim 5,wherein the change in the access state includes that the application isattempting to access the data object and wherein reprioritizing thesub-objects includes changing dynamically during recovery a priorityassigned to the sub-objects from a higher priority to a lower priorityin response to detecting the indication.
 7. The method of claim 1,wherein at least a subset of the plurality of sub-objects are assigned apriority from the first set of priorities, and the reprioritizing thesub-objects comprises assigning a priority from a second set ofpriorities to at least a subset of the sub-objects, and the at least thesubset of the plurality of sub-objects is assigned a new priority fromthe second set of priorities, contemporaneously with recovery of thebacked up data object.
 8. The method of claim 1, wherein recovering thebackup data includes recovering sub-objects to a remote location.
 9. Themethod of claim 1, wherein recovering the backup data includesrecovering sub-objects to a local location.
 10. The method of claim 1,wherein the data object includes a virtual machine.
 11. The method ofclaim 1, wherein the data object includes a version of the data object.12. The method of claim 1, further comprising: in response to the dataobject being closed while the data object is being recovered, assigninga new priority to each of at least a subset of the plurality ofsub-objects such that the new priority is lower than the priority fromthe first set of priorities previously assigned to the each of at leastthe subset of the plurality of sub-objects.
 13. The method of claim 1,further comprising: determining to pin at least one of a subset of theplurality of sub-objects to a remote recovery location based at least inpart on the information associated with the application's I/O that isreceived after recovery of the previously backed up data object hasstarted.
 14. The method of claim 13, wherein to pin the at least one ofthe subset of the plurality of sub-objects to a remote recoverycomprises restricting the at least one of the subset of the plurality ofsub-objects to be recovered only via the remote recovery during therecovery operation.
 15. The method of claim 13, wherein the determiningto pin at least one of the subset of the plurality of sub-objects to aremote recovery location comprises determining that the at least one ofthe subset of the plurality of sub-objects to be pinned to the remoterecovery location corresponds to data for which data integrityconsiderations are more important than performance considerations. 16.The method of claim 1, wherein the first set of priorities assigned tothe sub-objects are based at least in part on an access pattern withrespect to the at least a subset of the plurality of sub-objects. 17.The method of claim 1, the information associated with the application'sI/O obtained during the recovery of the backup data corresponds to aninput received from a user during the recovery.
 18. The method of claim1, wherein the determining to pin at least one of the subset of theplurality of sub-objects to a remote recovery location comprisesdetermining that the at least one of the subset of the plurality ofsub-objects to be pinned to the remote recovery location corresponds todata for which data integrity considerations are more important thanperformance considerations.
 19. A system, comprising a storage deviceand one or more processors and a memory to store instructions, whereinthe instructions are executed by the one or more processors to perform:selecting a previously backed up data object to be recovered usingbackup data, wherein the data object includes a plurality ofsub-objects; recovering the plurality of sub-objects based on a firstset of priorities assigned to the sub-objects; and reprioritizing thesub-objects based at least in part on information associated with anapplication's I/O received after recovery of the previously backed updata object has started, wherein the information associated with theapplication's I/O that is used in connection with reprioritizing thesub-objects is obtained during recovery of the backup data and comprisesinformation pertaining to an I/O event that is detected during recoveryof the backup data.
 20. A computer program product for recovering data,comprising a non-transitory computer readable storage medium havingcomputer readable code embodied therein that, executed by a computer,performs: selecting a previously backed up data object to be recoveredusing backup data, wherein the data object includes a plurality ofsub-objects; recovering the plurality of sub-objects based on a firstset of priorities assigned to the sub-objects; and reprioritizing thesub-objects based at least in part on information associated with anapplication's I/O received after recovery of the previously backed updata object has started, wherein the information associated with theapplication's I/O that is used in connection with reprioritizing thesub-objects is obtained during recovery of the backup data and comprisesinformation pertaining to an I/O event that is detected during recoveryof the backup data.